Optimal CPU Jobs Scheduling Method Based on Simulated Annealing Algorithm

Task scheduling in an important element a distributed system. It is vital how the jobs are correctly assigned for each computer’s processor to improve performance. The presented approaches attempt reduce expense of optimizing use CPU. These techniques mostly lack planning and need be comprehensive. To address this fault, hybrid optimization technique proposed hybridization both First-Come First-Served (FCFS), Shortest Job First (SJF). In addition, we propose apply Simulated Annealing (SA) algorithm as find optimal job’s execution sequence considering entrance time balance them waiting executed. As result, research proves that achieves efficiency with percentage average 45.5 % according FCFS 54.5% SJF method.